Abstraction and Modular Verification of Infinite-State Reactive Systems

ion and Modular Verification of Infinite-State Reactive Systems ⋆ Zohar Manna, Michael A. Colón, Bernd Finkbeiner, Henny B. Sipma and Tomás E. Uribe Computer Science Department Stanford University Stanford, CA. 94305-9045 [email protected] Abstract. We review a number of temporal verification techniques for reactive systems using modularity and abstraction. Their use allows the verification of larger systems, and the incremental verification of systems as they are developed and refined. In particular, we show how deductive verification tools, and the combination of finite-state model checking and abstraction, allow the verification of infinite-state systems featuring data types commonly used in software specifications, including real-time and hybrid systems. In Manfred Broy and Bernhard Rumpe, editors, Requirements Targeting Software and Systems Engineering, volume 1526 of Lecture Notes in Computer Science, pages 273–292. Springer-Verlag, 1998.